Optimal popular matchings
نویسندگان
چکیده
In this paper we consider the problem of computing an ‘‘optimal’’ popular matching. We assume that our input instance G = (A∪P , E1 ∪̇ · · · ∪̇ Er ) admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness inwhich casewe are required to return a fair popularmatching. We show an O(n2 + m) algorithm for this problem, assuming that the preference lists are strict, wherem is the number of edges in G and n is the number of applicants. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Efficient algorithms for bipartite matching problems with preferences
Matching problems involve a set of participants, where each participant has a capacity and a subset of the participants rank a subset of the others in order of preference (strictly or with ties). Matching problems are motivated in practice by large-scale applications, such as automated matching schemes, which assign participants together based on their preferences over one another. This thesis ...
متن کاملPopular Matchings: Structure and Algorithms
An instance of the popular matching problem (POP-M) consists of a set of applicants and a set of posts. Each applicant has a preference list that strictly ranks a subset of the posts. A matching M of applicants to posts is popular if there is no other matching M ′ such that more applicants prefer M ′ to M than prefer M to M . Abraham et al [1] described a linear time algorithm to determine whet...
متن کاملPopular Matchings with Variable Job Capacities
We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. A matching M is popular if there is no matching M such that the number of people who prefer...
متن کاملPopularity, Mixed Matchings, and Self-duality
Our input instance is a bipartite graph G = (A∪B,E) where A is a set of applicants, B is a set of jobs, and each vertex u ∈ A∪B has a preference list ranking its neighbors in a strict order of preference. For any two matchings M and T in G, let φ(M,T ) be the number of vertices that prefer M to T . A matching M is popular if φ(M,T )≥ φ(T,M) for all matchings T in G. There is a utility function ...
متن کاملTwo-sided popular matchings in bipartite graphs with forbidden/forced elements and weights
Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fair...
متن کاملPopular Mixed Matchings
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be more popular than T if the applicants that prefer M to T outnumber those that prefer T to M . A matching is said to be popular if there is no matching more popular than it. Equi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009